A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
نویسندگان
چکیده
منابع مشابه
Nearly Orthogonal Latin Squares
A Latin square of order n is an n by n array in which every row and column is a permutation of a set N of n elements. Let L = [li,j ] and M = [mi,j ] be two Latin squares of even order n, based on the same N -set. Define the superposition of L onto M to be the n by n array A = (li,j ,mi,j). When n is even, L and M are said to be nearly orthogonal if the superposition of L onto M has every order...
متن کاملA note on completing latin squares
We give a condition on the spatial distribution of filled cells in a partial Latin square P that is sufficient to ensure completability, regardless of what symbols are used in the filled cells. For example, if P is of the order mr + t, where m, r are positive integers and t ≥ 0, m is odd, and the filled cells of P are contained in the first m+1 2 r × r subsquares along the main diagonal, our co...
متن کاملA note on orthogonal Latin hypercubes
Latin hypercube designs have been found very useful for designing computer experiments. In recent years, several methods of constructing orthogonal Latin hypercube designs have been proposed in the literature. In this article, we report some more results on Latin hypercube designs, including several new designs.
متن کاملA note on Power Domination Problem in Diameter Two Graphs
The power domination problem aims to find the minimum number of phase measurement units (PMUs) required in order to observe the entire electric power system. Zhao and Kang [6] remarked that there is no known nonplanar graph of diameter two with a power domination number that is arbitrarily large. In this note, we show that the power domination number of such graphs can be arbitrarily large.
متن کاملIntersection numbers of Latin squares with their own orthogonal mates
Let J∗(v) be the set of all integers k such that there is a pair of Latin squares L and L′ with their own orthogonal mates on the same v-set, and with L and L′ having k cells in common. In this article we completely determine the set J∗(v) for integers v ≥ 24 and v = 1, 3, 4, 5, 8, 9. For v = 7 and 10 ≤ v ≤ 23, there are only a few cases left undecided for the set J∗(v).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1977
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90008-9